A Unified Translation of Linear Temporal Logic to ω-Automata
نویسندگان
چکیده
منابع مشابه
Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic
This paper addresses the problem of generating deterministic ω-automata for formulas of linear temporal logic, which can be solved by applying wellknown algorithms to construct a nondeterministic Büchi automaton for the given formula on which we then apply a determinization algorithm. We study here in detail Safra’s determinization algorithm, present several heuristics that attempt to decrease ...
متن کاملImproved Automata Generation for Linear Temporal Logic
We improve the state-of-the-art algorithm for obtaining an automaton from a linear temporal logic formula. The automaton is intended to be used for model checking, as well as for satisfiability checking. Therefore, the algorithm is mainly concerned with keeping the automaton as small as possible. The experimental results show that our algorithm outperforms the previous one, with respect to both...
متن کاملLinear-Time Temporal Logic and Büchi Automata
Over the past two decades, temporal logic has become a very basic tool for specifying properties of reactive systems. For finite-state systems, it is possible to use techniques based on Büchi automata to verify if a system meets its specifications. This is done by synthesizing an automaton which generates all possible models of the given specification and then verifying if the given system refi...
متن کاملConversion Algorithm of Linear-Time Temporal Logic to Buchi Automata
The size of Büchi Automata(BA) is a key factor during converting Linear-Time Temporal Logic(LTL) formulae to BA in model checking. Most algorithms for generating BA from LTL formulas involved intermediate automata, degeneralization algorithm and simplification of the formulas, but size of BA and time of converting can be reduced further. In this paper, we present an improved Tableau-based algor...
متن کاملConverting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata
Recently a new method directly translating linear temporal logic (LTL) formulas to deterministic (generalized) Rabin automata was proposed by Javier Esparza and Jan Kret́ınský [1]. Compared to the existing approaches of constructing a non-deterministic Buechi-automaton in the first step and then applying a determinization procedure (e.g. some variant of Safra’s construction) in a second step, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2020
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3417995